The clique density theorem
نویسندگان
چکیده
منابع مشابه
The Borel density theorem
We discuss the Borel density theorem and prove it for SLn(Z). This short note is devoted to the Borel density theorem. Lattices. If G is a Lie group, then a subgroup Γ < G is a lattice if Γ is discrete and the quotient G/Γ supports a G-invariant Riemannian metric of finite volume. Here we are regarding G/Γ as the space of left cosets gΓ, so G acts on the left. Example. Let G = R and Γ = Z. Then...
متن کاملOn the Density Theorem
5 and the integrals of the second member are taken along the arcs sM of the spirals (S£) from (2"). The proof, proceeding along the same lines as that of (6), is suppressed here. Remark. The explicit values of the elementary integrals (3) are, of course, well known; but we refrain purposely from using them, as they are not needed. It is, indeed, sufficient for our proofs to know that those inte...
متن کاملOn the minimum density of 2-clique and 3/2-clique in directed graphs
For an integer k, a k-clique is a graph in which the distance from one node to any other is at most k. The concept has been used to find cohesive groups in social network analysis. Traditionally, the k-clique is defined on undirected graphs, i.e., the relation is reciprocal. In this paper, we study the minimum density of a 2-clique when the graph is directed. In a directed graph, it is also pos...
متن کاملthe effect of traffic density on the accident externality from driving the case study of tehran
در این پژوهش به بررسی اثر افزایش ترافیک بر روی تعداد تصادفات پرداخته شده است. به این منظور 30 تقاطع در شهر تهران بطور تصادفی انتخاب گردید و تعداد تصادفات ماهیانه در این تقاطعات در طول سالهای 89-90 از سازمان کنترل ترافیک شهر تهران استخراج گردید و با استفاده از مدل داده های تابلویی و نرم افزار eviews مدل خطی و درجه دوم تخمین زده شد و در نهایت این نتیجه حاصل شد که تقاطعات پر ترافیک تر تعداد تصادفا...
15 صفحه اولA Density Turán Theorem
Let F be a graph which contains an edge whose deletion reduces its chromatic number. For such a graph F, Simonovits proved there exists a constant n0 = n0(F ) such that every graph on n > n0 vertices with more than χ(F )−2 χ(F )−1 · n 2 2 edges contains a copy of F . In this paper we derive a similar theorem for multipartite graphs. For a graph H and an integer l ≥ v(H), let dl(H) be the minimu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics
سال: 2016
ISSN: 0003-486X
DOI: 10.4007/annals.2016.184.3.1